Introduction to Algorithms - PDFSEARCH.IO - Document Search Engine

Introduction to Algorithms
Results: 201

#	Item
191	Partitioned counters design Nov[removed]Rev 3. Introduction Partitioned counters is a distributed, non-atomic counter implementation on top of Apache Cassandra. A value can now represent a counter that is able to receive u Add to Reading List Source URL: issues.apache.org Language: English Computing Data Column Logical clock Apache Cassandra Extensible Storage Engine Vector clock Tuple Data management Distributed algorithms NoSQL
192	Introduction to genetic algorithms Add to Reading List Source URL: www.rennard.org Language: English - Date: 2014-02-14 11:30:43 Science Mutation Crossover Chromosome Evolution Genetic operator Fitness proportionate selection Selection Algorithm Genetic algorithms Applied mathematics Mathematics
193	Massachusetts Institute of Technology School of Engineering Faculty Personnel Record Date: April 11, 2013 Full Name: Charles E. Leiserson Department: Electrical Engineering and Computer Science Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2013-04-11 02:21:12 Charles E. Leiserson Introduction to Algorithms Symposium on Parallelism in Algorithms and Architectures Nancy Lynch Thomas H. Cormen Clifford Stein Ron Rivest Nir Shavit W. Daniel Hillis Computing Computer science Academia
194	Introduction to Lock-Free Algorithms Through a case study Samy Al Bahra AppNexus, Inc. September 23, 2012 Add to Reading List Source URL: concurrencykit.org Language: English - Date: 2012-09-25 17:45:50 Concurrency Non-blocking algorithm FIFO Spinlock Lock Linearizability Concurrency control Computing Concurrent computing
195	Introduction to Computational Geometry Subir Kumar Ghosh Add to Reading List Source URL: www.tcs.tifr.res.in Language: English - Date: 2010-12-31 05:42:26 Computational geometry Simple polygon Polygon triangulation Polygon Convex hull algorithms Computational complexity theory Algorithm Straight skeleton Dynamic convex hull Geometry Mathematics Polygons
196	Research Promotion Workshop on Introduction to Graph and Geometric Algorithms National Institute of Technology Rourkela March 25-27, 2010 Program Add to Reading List Source URL: www.tcs.tifr.res.in Language: English - Date: 2012-03-10 04:45:27
197	Introduction to Approximation Algorithms Subir Kumar Ghosh School of Technology & Computer Science Tata Institute of Fundamental Research Mumbai[removed], India Add to Reading List Source URL: www.tcs.tifr.res.in Language: English - Date: 2011-01-10 05:25:38 NP-complete problems Approximation algorithm NP-complete Vertex cover Optimization problem Travelling salesman problem Steiner tree problem Set cover problem Graph coloring Theoretical computer science Mathematics Computational complexity theory
198	An Introduction to Mathematical Methods in Combinatorics Renzo Sprugnoli Add to Reading List Source URL: www.dsi.unifi.it Language: English - Date: 2009-12-17 03:41:51 Analysis of algorithms Number theory Computational complexity theory Integer sequences Asymptotic analysis Big O notation Time complexity Euler–Mascheroni constant Euclidean algorithm Mathematics Theoretical computer science Mathematical analysis
199	1 INTRODUCTION TO GENETIC Add to Reading List Source URL: www.genetic-programming.com Language: English - Date: 2006-11-17 21:13:01 Genetic programming Operations research John Koza Applied mathematics Science Mutation Fitness Mathematics Genetic algorithms Mathematical optimization Evolutionary algorithms
200	Complexity of Rectangular Mazes 1. Introduction. Consider the mazes in figure 1. Of these two mazes, which one is the more challenging? If we can order these mazes according to this criterion, then the Add to Reading List Source URL: www.math.uco.edu Language: English - Date: 2009-05-29 10:49:40 Topology Algorithms Maze generation algorithm Puzzles Maze Mazes

UPDATE